John Backus Totally Explained

Everything about John Backus totally explained

John Warner Backus (December 3, 1924 – March 17, 2007) was an American computer scientist. He led the team that invented the first widely used high-level programming language (FORTRAN) and was the inventor of the Backus-Naur form (BNF), the almost universally used notation to define formal language syntax. He also did research in function-level programming and helped to popularize it.
The IEEE awarded Backus the W.W. McDowell Award in 1967 for the development of FORTRAN . He received the National Medal of Science in 1975, and the 1977 ACM Turing Award “for profound, influential, and lasting contributions to the design of practical high-level programming systems, notably through his work on FORTRAN, and for seminal publication of formal procedures for the specification of programming languages.”

Life and career

Backus was born in Philadelphia, Pennsylvania, but grew up in Wilmington, Delaware. He studied at the Hill School in Pottstown, Pennsylvania, and was apparently not a diligent student. After entering the University of Virginia to study chemistry, he quit and was drafted into the U.S. Army..
   After moving to New York City he initially took training as a radio technician and discovered an interest in mathematics — it would prove to be his calling. He graduated from Columbia University with a Master's degree in 1949, and joined IBM in 1950. During his first three years, he worked on the SSEC; his first major project was to write a program to calculate positions of the Moon. In 1953, John Backus also developed the language Speedcoding, the first higher-order language created for an IBM computer .
   The difficulties of programming were acute, and in 1954 Backus assembled a team to define and develop Fortran for the IBM 704 computer. Though debatably not the first high-level programming language, it was the first to achieve wide use.
   John Backus made another, critical contribution to early computer science: During the latter part of the 1950s Backus served on the international committees which developed ALGOL 58 and the very influential ALGOL 60, which quickly became the de facto worldwide standard for publishing algorithms. Backus developed the Backus-Naur Form (BNF), in the UNESCO report on ALGOL 58. This was a formal notation with which one could describe any context-free programming language and was important in the development of compilers. This contribution helped Backus win the Turing Award.
   He later worked on a “function-level” programming language known as FP which was described in his Turing Award lecture “Can Programming be Liberated from the von Neumann Style?” Sometimes viewed as Backus’s apology for creating FORTRAN, this paper did less to garner interest in the FP language than to spark research into functional programming in general. An FP interpreter was distributed with the 4.2BSD Unix operating system. FP was strongly inspired by Kenneth E. Iverson’s APL, even using a non-standard character set. Backus spent the latter part of his career developing FL (from “Function Level”), a successor to FP. FL was an internal IBM research project, and development of the language essentially stopped when the project was finished (only a few papers documenting it remain), but many of the language’s innovative, arguably important ideas have now been implemented in Iverson’s J programming language.
   Backus was named an IBM Fellow in 1963, and was awarded a honoris causa from the University Henri Poincaré in Nancy (France) in 1989 and a Draper Prize in 1993. He retired in 1991 and died at his home in Ashland, Oregon on March 17, 2007.

Asteroid 6830 Johnbackus named in his honour (June 1st, 2007) Further Information

Get more info on 'John Backus'.

External Link Exchanges

Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:

<a href="http://john_backus.totallyexplained.com">John Backus Totally Explained</a>

Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned.